On parallel Turing machines with multi-head control units

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Parallel Turing Machines with Multi-Head Control Units

This paper deals with parallel Turing machines with multi-head control units on one or more tapes which can be considered as a generalization of cellular automata. We discuss the problem of nding an appropriate measure of space complexity. A deenition is suggested which implies that the model is in the rst machine class. It is shown that without loss of generality it suuces to consider only par...

متن کامل

Parallel Turing Machines with One-Head Control Units and Cellular Automata

Parallel Turing machines (Ptm) can be viewed as a generalization of cellular au-tomata (Ca) where an additional measure called processor complexity can be deened which indicates the \amount of parallelism" used. In this paper Ptm are investigated with respect to their power as recognizers of formal languages. A combinatorial approach as well as diagonalization are used to obtain hierarchies of ...

متن کامل

Turing Tests with Turing Machines

Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like to have a Turing Test where the reference a...

متن کامل

Parallel Turing Machines on a Two-Dimensional Tape

We introduce two models of parallel twodimensional Turing machine with different possibilities of communication among control units and we compare them.

متن کامل

A formalization of multi-tape Turing machines

We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and assessing the state of the art in the mechanization of formal reasoning. The work is meant to be a preliminary step towards the creation of a form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Parallel Computing

سال: 1997

ISSN: 0167-8191

DOI: 10.1016/s0167-8191(97)00082-3